A new subgroup lattice characterization of finite solvable groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative non-Normal Graphs of a Subgroup of Finite Groups

Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...

متن کامل

Solvable $L$-subgroup of an $L$-group

In this paper, we study the notion of solvable $L$-subgroup of an $L$-group and provide its level subset characterization and this justifies the suitability of this extension. Throughout this work, we have used normality of an $L$-subgroup of an $L$-group in the sense of Wu rather than Liu.

متن کامل

A characterization of subgroup lattices of finite Abelian groups

We show that every primary lattice can be considered a glueing of intervals having geometric dimension at least 3 and with a skeleton of breadth at most 2. We call this geometric decomposition. In the Arguesian case, we analyse the sub-glueings corresponding to cover preserving sublattices of the skeleton which are 2-element chains or a direct product of 2 such. We show that these admit a cover...

متن کامل

On $m^{th}$-autocommutator subgroup of finite abelian groups

Let $G$ be a group and $Aut(G)$ be the group of automorphisms of‎ ‎$G$‎. ‎For any natural‎ number $m$‎, ‎the $m^{th}$-autocommutator subgroup of $G$ is defined‎ ‎as‎: ‎$$K_{m} (G)=langle[g,alpha_{1},ldots,alpha_{m}] |gin G‎,‎alpha_{1},ldots,alpha_{m}in Aut(G)rangle.$$‎ ‎In this paper‎, ‎we obtain the $m^{th}$-autocommutator subgroup of‎ ‎all finite abelian groups‎.

متن کامل

finite bci-groups are solvable

‎let $s$ be a subset of a finite group $g$‎. ‎the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g‎, ‎ sin s}$‎. ‎a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$‎, ‎whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2012

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2011.10.032